Comment on New Construction of Efficient Certificateless Aggregate Signatures
نویسندگان
چکیده
Aggregate signature can combine n signatures on n messages from n users into single signature, and the verifier should be convinced by the aggregate signature that n users indeed sign n messages. Since aggregate signature can greatly reduce the length of total signature and the cost of verification, it is widely used in environments with low bandwidth communication, low storage and low computability. Recently, Liu et al. [H Liu, S Wang, M Liang and Y Chen, “New Construction of Efficient Certificateless Aggregate Signatures”, International Journal of Security and Its Applications Vol.8, No.1 (2014), pp. 411-422] proposed an efficient certificateless aggregate signature scheme which is proven existentially unforgeable against adaptive chosen-message attacks. Unfortunately, Liu et al.’s new certificateless signature scheme is insecure. In this paper, giving concrete and simple attacks, we demonstrate that type II adversary key generation center can make ordinary-passive attack and malicious-active attack to forge legal certificateless signatures and certificateless aggregate signatures on any messages. Furthermore, we analyze possible reasons why key generation center succeeds in ordinary-passive attack and malicious-active attack.
منابع مشابه
New Construction of Efficient Certificateless Aggregate Signatures
This paper proposes a novel construction of efficient certificateless aggregate signature (CLAS) scheme. On basis of the computational Diffie-Hellman (CDH) assumption, the proposed scheme can be proven existentially unforgeable against adaptive chosen-message attacks. The new scheme also requires small constant pairing computations for aggregate verification, which is independent of the number ...
متن کاملNovel Efficient Certificateless Aggregate Signatures
We propose a new efficient certificateless aggregate signature scheme which has the advantages of both aggregate signatures and certificateless cryptography. The scheme is proven existentially unforgeable against adaptive chosen-message attacks under the standard computational Diffie-Hellman assumption. Our scheme is also efficient in both communication and computation. The proposal is practica...
متن کاملAn efficient certificateless aggregate signature with conditional privacy-preserving for vehicular sensor networks
Certificateless public key cryptography was introduced to solve the complicated certificate management problem in traditional public key cryptography and the key escrow problem in identity-based cryptography. The aggregate signature concept is useful in special areas where the signatures on many different messages generated by many different users need to be compressed. This feature is very att...
متن کاملCertificate-based Signatures Revisited
Certificate-based encryption was introduced in Eurocrypt’03 to solve the certificate management problem in public key encryption. Recently, this idea was extended to certificate-based signatures. Several new schemes and security models of certificate-based signatures have been proposed. In this paper, we first take a closer look at the certificate-based signature by comparing it with digital si...
متن کاملEfficient Certificateless Signatures Suitable for Aggregation
This technical report describes a novel certificateless signature scheme suitable for aggregation that requires no pairing computations for signing and only 3 pairing computations for signature verification. We provide proofs for the security of single and aggregate signatures.
متن کامل